QFQ: Efficient Packet Scheduling With Tight Guarantees

QFQ: Efficient Packet Scheduling with Tight Bandwidth Distribution Guarantees

Packet scheduling, together with classification, is one of the expensive processing steps in systems providing tight bandwidth and delay guarantees at high packet rates. Schedulers with near-optimal bandwidth distribution and O(1) time complexity in the number of flows have been proposed in the literature, they adopt techniques as timestamp rounding and flow grouping to keep their execution tim...

Efficient Packet Scheduling with Tight Bandwidth Distribution Guarantees

One of the key issues in providing tight bandwidthand delay guarantees with high speed systems is the cost of packetscheduling. Through timestamp rounding and flow groupingseveral schedulers have been designed that provide near-optimalbandwidth distribution with O(1) time complexity. However, inone of the two lowest complexity proposals in the literature, thecost of each...

Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee

Packet Scheduling with Fragmentation

We investigate a scheduling problem in a TDMA environment where packets may be fragmented. Our model of the problem is derived from a scheduling problem present in data over CATV networks, where a slotted TDMA channel is used to carry both real-time and best-effort traffic. Packets of real-time flows have high priority and are allocated in fixed, periodically located slots. Best-effort packets ...

Disk Scheduling with Quality of Service Guarantees

This paper introduces YFQ, a new disk scheduling algorithm that allows applications to set aside for exclusive use portions of the disk bandwidth. We implemented YFQ as part of the Eclipse/BSD operating system, which is derived from FreeBSD, a version of 4.4 BSD Unix. YFQ’s disk bandwidth reservations can guarantee file accesses with high throughput, low delay, and good fairness. Such quality o...